Orbits in finite regular graphs
نویسندگان
چکیده
منابع مشابه
Finite vertex primitive 2-arc regular graphs
A classification is given of finite graphs that are vertex primitive and 2arc regular. The classification involves various new constructions of interesting 2-arc transitive graphs.
متن کاملEmbedding arbitrary finite simple graphs into small strongly regular graphs
It is well-known that any nite simple graph ? is an induced sub-graph of some exponentially larger strongly regular graph ? (e.g. 2, 8]). No general polynomial-size construction has been known. For a given-nite simple graph ? on v vertices we present a construction of a strongly regular graph ? on O(v 4) vertices that contains ? as its induced sub-graph. A discussion is included of the size of ...
متن کاملOrbits on vertices and edges of finite graphs
In this paper , we shall answer two questions raised by J. Doyen. All graphs are supposed to be undirected, without loops and multiple edges. Let P (resp. Pc) be the set of all ordered pairs (v, e) of integers v > 0 and e I> 0 for which there exists a finite graph (resp. a finite connected graph) whose automorphism group has exactly v orbits on the set of vertices and e orbits on the set of edg...
متن کاملRegular factors in regular graphs
Katerinis, P., Regular factors in regular graphs, Discrete Mathematics 113 (1993) 269-274. Let G be a k-regular, (k I)-edge-connected graph with an even number of vertices, and let m be an integer such that 1~ m s k 1. Then the graph obtained by removing any k m edges of G, has an m-factor. All graphs considered are finite. We shall allow graphs to contain multiple edges and we refer the reader...
متن کاملFinite 1 - Regular Cayley Graphs of Valency 5
Let Γ = Cay(G, S) and G ≤ X ≤ AutΓ. We say Γ is (X, 1)-regular Cayley graph if X acts regularly on its arcs. Γ is said to be corefree if G is core-free in some X ≤ Aut(Cay(G, S)). In this paper, we prove that if an (X, 1)-regular Cayley graph of valency 5 is not normal or binormal, then it is the normal cover of one of two core-free ones up to isomorphism. In particular, there are no core-free ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2007
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2005.04.013